翻訳と辞書 Words near each other ・ Trust Merchant Bank ・ Trust Metric ・ Trust metric ・ Trust money ・ Trust No 1 ・ Trust No One ・ Trust No One (Dave Navarro album) ・ Trust No One (Hopes Die Last album) ・ Trust no one (internet security) ・ Trust No One (N17 album) ・ Trust Oldham ・ Trust on first use ・ Trust PA ・ Trust Party ・ Trust port ・ Trust region ・ Trust seal ・ Trust Territory (novel) ・ Trust Territory of Somaliland ・ Trust Territory of Somaliland somalo ・ Trust Territory of the Pacific Islands ・ Trust Territory of the Pacific Islands constitutional referendum, 1978 ・ Trust Territory of the Pacific Islands status referendum, 1975 ・ Trust the Man ・ Trust the Navy ・ Trust the Saint ・ Trust the Tangerine Peel ・ Trust Us ・ Trust Us with Your Life ・ Trust Us, We're Experts Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Trust region ： ウィキペディア英語版 Trust region Trust region is a term used in mathematical optimization to denote the subset of the region of the objective function that is approximated using a model function (often a quadratic). If an adequate model of the objective function is found within the trust region then the region is expanded; conversely, if the approximation is poor then the region is contracted. Trust region methods are also known as restricted step methods. The fit is evaluated by comparing the ratio of expected improvement from the model approximation with the actual improvement observed in the objective function. Simple thresholding of the ratio is used as the criterion for expansion and contraction—a model function is "trusted" only in the region where it provides a reasonable approximation. Trust region methods are in some sense dual to line search methods: trust region methods first choose a step size (the size of the trust region) and then a step direction while line search methods first choose a step direction and then a step size. The earliest use of the term seems to be by Sorensen (1982). ==Example== Conceptually, in the Levenberg–Marquardt algorithm, the objective function is iteratively approximated by a quadratic surface, then using a linear solve, the estimate is updated. This alone may not converge nicely if the initial guess is too far from the optimum. For this reason, the algorithm instead restricts each step, preventing it from stepping "too far". It operationalizes "too far" as follows. Rather than solving $A\; \backslash Delta\; x\; =\; b$ for $\backslash Delta\; x$, it solves $(A\; +\; \backslash lambda\; \backslash operatorname(A)\; )\; \backslash Delta\; x\; =\; b$ where $\backslash operatorname(A)$ is the diagonal matrix with the same diagonal as ''A'' and λ is a parameter that controls the trust-region size. Geometrically, this adds a paraboloid centered at $\backslash Delta\; x=0$ to the quadratic form, resulting in a smaller step. The trick is to change the trust-region size (λ). At each iteration, the damped quadratic fit predicts a certain reduction in the cost function, $\backslash Delta\; f\_\}\; =\; f(x+\backslash Delta\; x)\; -\; f(x)$ By looking at the ratio $\backslash Delta\; f\_\}$ we can adjust the trust-region size. In general, we expect $\backslash Delta\; f\_\}$ and so the ratio would be between, say, 0.25 and 0.5. If the ratio is more than 0.5, then we aren't damping the step much, so expand the trust region (decrease λ), and iterate. If the ratio is smaller than 0.25, then the true function is diverging "too much" from the trust-region approximation, so shrink the trust region (increase λ) and try again. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Trust region」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.